Constraints on Hypercomputation
نویسندگان
چکیده
Wegner and Eberbach[Weg04b] have argued that there are fundamental limitations to Turing Machines as a foundation of computability and that these can be overcome by so-called superTuring models. In this paper we contest their claims for interaction machines and the πcalculus.
منابع مشابه
Physical constraints on hypercomputation
“To infinity, and beyond!”, Buzz Lightyear, Toy Story, Pixar, 1995. Many attempts to transcend the fundamental limitations to computability implied by the Halting Problem for Turing Machines depend on the use of forms of hypercomputation that draw on notions of infinite or continuous, as opposed to bounded or discrete, computation. Thus, such schemes may include the deployment of actualised rat...
متن کاملNon-Classical Hypercomputation
Hypercomputation that seeks to solve the Halting Problem, or to compute Turing-uncomputable numbers, might be called “classical” hypercomputation, as it moves beyond the classical Turing computational paradigm. There are further computational paradigms that we might seek to move beyond, forming the basis for a wider “non-classical” hypercomputation. This paper surveys those paradigms, and poses...
متن کاملHypercomputation: philosophical issues
A survey of the /eld of hypercomputation, including discussion of four a priori objections to the possibility of hypercomputation. An exegesis of Turing’s preand post-war writings on the mind is given, and Turing’s views on the scope of machines are discussed. c © 2003 Published by Elsevier B.V.
متن کاملThe case for hypercomputation
The weight of evidence supporting the case for hypercomputation is compelling. We examine some 20 physical and mathematical models of computation that are either known or suspected to have super-Turing or hypercomputational capabilities, and argue that there is nothing in principle to prevent the physical implementation of hypercomputational systems. Hypercomputation may indeed be intrinsic to ...
متن کاملSome Thoughts on Hypercomputation
Hypercomputation is a relatively new branch of computer science that emerged from the idea that the Church–Turing Thesis, which is supposed to describe what is computable and what is noncomputable, cannot possible be true. Because of its apparent validity, the Church–Turing Thesis has been used to investigate the possible limits of intelligence of any imaginable life form, and, consequently, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006